A Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy
نویسندگان
چکیده
Given two structures G and H distinguishable in FOk (first-order logic with k variables), let Ak(G,H) denote the minimum alternation depth of a FOk formula distinguishing G from H. Let Ak(n) be the maximum value of Ak(G,H) over n-element structures. We prove the strictness of the quantifier alternation hierarchy of FO2 in a strong quantitative form, namely A2(n) > n/8−2, which is tight up to a constant factor. For each k ≥ 2, it holds that Ak(n) > logk+1 n− 2 even over colored trees, which is also tight up to a constant factor if k ≥ 3. For k ≥ 3 the last lower bound holds also over uncolored trees, while the alternation hierarchy of FO2 collapses even over all uncolored graphs. We also show examples of colored graphs G and H on n vertices that can be distinguished in FO2 much more succinctly if the alternation number is increased just by one: while in Σi it is possible to distinguish G from H with bounded quantifier depth, in Πi this requires quantifier depth Ω(n2). The quadratic lower bound is best possible here because, if G and H can be distinguished in FOk with i quantifier alternations, this can be done with quantifier depth n2k−2 + 1 and the same number of alternations.
منابع مشابه
Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable
We consider the quantifier alternation hierarchy within two-variable first-order logic FO2[<, suc] over finite words with linear order and binary successor predicate. We give a single identity of omega-terms for each level of this hierarchy. This shows that for a given regular language and a non-negative integer m it is decidable whether the language is definable by a formula in FO2[<, suc] whi...
متن کاملThe Monadic Quantifier Alternation Hierarchy over Graphs is Infinite
We show that in monadic second-order logic over finite directed graphs, a strict hierarchy of expressiveness is obtained by increasing the (second-order) quantifier alternation depth of formulas. Thus, the “monadic analogue” of the polynomial hierarchy is found to be strict, which solves a problem of Fagin. The proof is based on automata theoretic concepts (rather than Ehrenfeucht-Fraı̈ssé games...
متن کاملFinite-Degree Predicates and Two-Variable First-Order Logic
We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the order predicate only. From this result we derive the separation of the alternation hierarchy of two-variable logic on this signature.
متن کاملExpressive power of monadic logics on words, trees, pictures, and graphs
We give a survey of the expressive power of various monadic logics on specific classes of finite labeled graphs, including words, trees, and pictures. Among the logics we consider, there are monadic secondorder logic and its existential fragment, the modal mu-calculus, and monadic least fixed-point logic. We focus on nesting-depth and quantifier alternation as a complexity measure of these logics.
متن کاملOn FO2 Quantifier Alternation over Words
We show that each level of the quantifier alternation hierarchy within FO[<] on words is a variety of languages. We use the notion of condensed rankers, a refinement of the rankers defined by Weis and Immerman, to produce a decidable hierarchy of varieties which is interwoven with the quantifier alternation hierarchy – and conjecturally equal to it. It follows that the latter hierarchy is decid...
متن کامل